Spectral radii of sparse random matrices
نویسندگان
چکیده
منابع مشابه
Spectral radii of sparse random matrices
We establish bounds on the spectral radii for a large class of sparse random matrices, which includes the adjacency matrices of inhomogeneous Erdős-Rényi graphs. For the Erdős-Rényi graph G(n, d/n), our results imply that the smallest and second-largest eigenvalues of the adjacency matrix converge to the edges of the support of the asymptotic eigenvalue distribution provided that d log n. Toget...
متن کاملSpectral Analysis of Random Sparse Matrices
We study n×n random symmetric matrices whose entries above the diagonal are iid random variables each of which takes 1 with probability p and 0 with probability 1 − p, for a given density parameter p = α/n for sufficiently large α. For a given such matrix A, we consider a matrix A′ that is obtained by removing some rows and corresponding columns with too many value 1 entries. Then for this A′, ...
متن کاملSpectral Radii of Large Non-Hermitian Random Matrices
By using the independence structure of points following a determinantal point process, we study the radii of the spherical ensemble, the truncation of the circular unitary ensemble and the product ensemble with parameter n and k. The limiting distributions of the three radii are obtained. They are not the Tracy-Widom distribution. In particular, for the product ensemble, we show that the limiti...
متن کاملSpectra of sparse random matrices
We compute the spectral density for ensembles of of sparse symmetric random matrices using replica. Our formulation of the replica-symmetric ansatz shares the symmetries of the one suggested in a seminal paper by Rodgers and Bray (symmetry with respect to permutation of replica and rotation symmetry in the space of replica), but uses a different representation in terms of superpositions of Gaus...
متن کاملSparse Recovery Using Sparse Random Matrices
Over the recent years, a new *linear* method for compressing high-dimensional data (e.g., images) has been discovered. For any high-dimensional vector x, its *sketch* is equal to Ax, where A is an m x n matrix (possibly chosen at random). Although typically the sketch length m is much smaller than the number of dimensions n, the sketch contains enough information to recover an *approximation* t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
سال: 2020
ISSN: 0246-0203
DOI: 10.1214/19-aihp1033